Density-Controlled Sampling of Parametric Surfaces Using Adaptive Space-Filling Curves
نویسندگان
چکیده
Low-discrepancy point distributions exhibit excellent uniformity properties for sampling in applications such as rendering and measurement. We present an algorithm for generating low-discrepancy point distributions on arbitrary parametric surfaces using the idea of converting the 2D sampling problem into a 1D problem by adaptively mapping a space-filling curve onto the surface. The 1D distribution takes into account the parametric mapping by employing a corrective approach similar to histogram equalisation to ensure that it gives a 2D low-discrepancy point distribution on the surface. This also allows for control over the local density of the distribution, e.g. to place points more densely in regions of higher curvature. To allow for parametric distortion, the space-filling curve is generated adaptively to cover the surface evenly. Experiments show that this approach efficiently generates low-discrepancy distributions on arbitrary parametric surfaces and creates nearly as good results as well-known low-discrepancy sampling methods designed for particular surfaces like planes and spheres. However, we also show that machineprecision limitations may require surface reparameterisation in addition to adaptive sampling.
منابع مشابه
Fast Low-discrepancy Sampling of Parametric Surfaces and Meshes
This paper summarises work on low-discrepancy sampling of parametric surfaces and meshes based on use of space-filling curves, and suggests two applications of such work: shape retrieval based on distance histograms, and non-photorealistic stroke-based rendering.
متن کاملParameter Aligned Trimmed Surfaces
We present a new representation for trimmed parametric surfaces. Given a set of trimming curves in the parametric domain of a surface, our method locally reparametrizes the parameter space to permit accurate representation of these features without partitioning the surface into subsurfaces. Instead, the parameter space is segmented into subspaces containing the trimming curves, the boundaries o...
متن کاملTime Complexity of algorithms that update the Sierpiński-like and Modified Hilbert Curves
This paper presents the time complexity of two algorithms that update space-filling curves of adaptively refined domains. The Modified Hilbert (space-filling) Curve was proposed to traverse square-shaped adaptive-refined meshes. Whereas, the Sierpiński-like (space-filling) Curve was proposed in order to traverse triangular-shaped adaptive-refined meshes. Those curves are variations of the names...
متن کاملNumerical parameterization of curves and surfaces
A method for parameterizing nearly arbitrary implicit plane/space curves and surfaces is introduced. The parameterizations are of class Cn−1 if the given curves/surfaces are of class Cn. The computation of points and derivatives is performed numerically. These parameterizations can be used for controlled determination of points on curves and surfaces and for the application of developed techniq...
متن کاملSpace Filling Curves for 3D Sensor Networks with Complex Topology
Several aspects of managing a sensor network (e.g., motion planning for data mules, serial data fusion and inference) benefit once the network is linearized to a path. The linearization is often achieved by constructing a space filling curve inside the domain. But existing methods cannot handle networks distributed on surfaces of complex topology. This paper presents a novel method for generati...
متن کامل